How to Compress Asymmetric Communication

نویسندگان

  • Sivaramakrishnan Natarajan Ramamoorthy
  • Anup Rao
چکیده

We study the relationship between communication and information in 2-party communication protocols when the information is asymmetric. If I denotes the number of bits of information revealed by the first party, I denotes the information revealed by the second party, and C is the number of bits of communication in the protocol, we show that one can simulate the protocol using order I + 4 √ C3 · IB · logC + √ C · IB · logC bits of communication, one can simulate the protocol using order I · 2O(IB) bits of communication. The first result gives the best known bound on the complexity of a simulation when I I , C3/4. The second gives the best known bound when I logC. In addition we show that if a function is computed by a protocol with asymmetric information complexity, then the inputs must have a large, nearly monochromatic rectangle of the right dimensions, a fact that is useful for proving lower bounds on lopsided communication problems. 1998 ACM Subject Classification F.1.2 Modes of Computation

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compressing Probability Distributions

Manipulating probability distributions is central to data compression, so it is natural to ask how well we can compress probability distributions themselves. For example, this is useful for probabilistic reasoning [2] and query optimization [6]. Our interest in it stems from designing single-round asymmetric communication protocols [1,4]. Suppose a server with high bandwidth wants to help a cli...

متن کامل

Compression of atomic phase space using an asymmetric one-way barrier.

We show how to construct asymmetric optical barriers for atoms. These barriers can be used to compress phase-space of a sample by creating a confined region in space where atoms can accumulate with heating at the single photon recoil level. We illustrate our method with a simple two-level model and then show how it can be applied to more realistic multilevel atoms.

متن کامل

عنوان : Comparing the effect of warm moist compress and Calendula ointment on the severity of phlebitis caused by 50% dextrose infusion: A clinical trial

چکیده: Background: One of the important hypertonic solutions is 50% dextrose. Phlebitis is the most common complication of this solution, the management of which is quite necessary. Regarding this, the present study aimed to compare the effect of warm moist compress and Calendula ointment on the severity of phlebitis caused by 50% dextrose infusion. Methods: This clinical trial was conducted on...

متن کامل

CS 2429 - Foundations of Communication Complexity Lecture # 8 : 7 November 2012 Lecturer : Lila Fontes

Today we’ll cover some recent results from the paper Lower bounds on information complexity via zero-communication bounds and applications by Kerenidis, Laplante, Lerays, Roland, and Xiao (FOCS 2012). We’ll also recall results covered in past lectures from the papers The partition bound for classical communication complexity and query complexity by Jain and Klauck (CCC 2010) and How to compress...

متن کامل

Bilateral Teleoperation Systems Using Backtracking Search optimization Algorithm Based Iterative Learning Control

This paper deals with the application of Iterative Learning Control (ILC) to further improve the performance of teleoperation systems based on Smith predictor. The goal is to achieve robust stability and optimal transparency for these systems. The proposed control structure make the slave manipulator follow the master in spite of uncertainties in time delay in communication channel and model pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2015